Varieties of Distributivity: 'One by One' vs 'Each'
نویسندگان
چکیده
منابع مشابه
Varieties of Distributivity: One by One vs Each
Consider the contrast in interpretation between the examples in (1) and (2) below. While example (1) is compatible with events that unfold in very different ways, the addition of one by one in (2) constrains how the leaving events can proceed. Intuitively, one by one is an event modifier that targets a plural participant in the event. More precisely, it breaks the event down into temporally seq...
متن کاملEach vs. Jeweils: A Cover-Based View on Distance Distributivity
Zimmermann (2002) identifies two kinds of distance-distributive items across languages. The first kind (e.g. each) is restricted to distribution over individuals; the second kind (e.g. German jeweils) can also be interpreted as distributing over salient occasions. I explain this behavior by formally relating this split to the two distributivity operators proposed in the work of Link (atomic ope...
متن کاملProjective varieties invariant by one - dimensional foliations
This work concerns the problem of relating characteristic numbers of onedimensional holomorphic foliations of PC to those of algebraic varieties invariant by them. More precisely: if M is a connected complex manifold, a one-dimensional holomorphic foliation F of M is a morphism Φ : L −→ TM where L is a holomorphic line bundle on M . The singular set of F is the analytic subvariety sing(F) = {p ...
متن کاملComputers on wheels: an alternative to 'each one has one'
Four fifth-grade classrooms embarked on a modified ubiquitous computing initiative in the fall of 2003. Two 15-computer wireless laptop carts were shared among the four classrooms in an effort to integrate technology across the curriculum and affect change in student learning and teacher pedagogy. This initiative—in contrast to other one-to-one programmemess and stationary labs—offers public sc...
متن کاملOn Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry
An algorithm for unification modulo one-sided distributivity is an early result by Tidén and Arnborg. More recently this theory has been of interest in cryptographic protocol analysis due to the fact that many cryptographic operators satisfy this property. Unfortunately the algorithm presented in the paper, although correct, has recently been shown not to be polynomial time bounded as claimed. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Semantics and Linguistic Theory
سال: 2015
ISSN: 2163-5951
DOI: 10.3765/salt.v0i0.2538